complete partial ordering - definition. What is complete partial ordering
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

%ما هو (من)٪ 1 - تعريف

TERM USED IN MATHEMATICAL ORDER THEORY
Directed complete partial order; Complete poset; Directed-complete poset; Directed-complete partially ordered set

complete partial ordering      
<theory> (cpo) A partial ordering of a set under a relation, where all directed subsets have a {least upper bound}. A cpo is usually defined to include a least element, bottom (David Schmidt calls this a pointed cpo). A cpo which is algebraic and boundedly complete is a (Scott) domain. (1994-11-30)
Chain-complete partial order         
POSET COMPLETION
Chain complete; Chain completeness
In mathematics, specifically order theory, a partially ordered set is chain-complete if every chain in it has a least upper bound. It is ω-complete when every increasing sequence of elements (a type of countable chain) has a least upper bound; the same notion can be extended to other cardinalities of chains..
Complete partial order         
In mathematics, the phrase complete partial order is variously used to refer to at least three similar, but distinct, classes of partially ordered sets, characterized by particular completeness properties. Complete partial orders play a central role in theoretical computer science: in denotational semantics and domain theory.

ويكيبيديا

Complete partial order

In mathematics, the phrase complete partial order is variously used to refer to at least three similar, but distinct, classes of partially ordered sets, characterized by particular completeness properties. Complete partial orders play a central role in theoretical computer science: in denotational semantics and domain theory.